Set covering problem with conflict constraints
نویسندگان
چکیده
In this article, we consider the set covering problem with conflict constraints, i.e., from each conflicting pair of columns at most one column can appear in feasible solution. For problem, propose appropriate pre-processing techniques and several families Valid Inequalities (VIs) for corresponding integer programming model that result simultaneous presence constraints stable (conflict) constraints. We then carry out a computational experiment to demonstrate effectiveness proposed methods. • An IP Several new problem. A six-phase method (including all VIs) solve studies show
منابع مشابه
2 Set Covering Problem
In the previous lecture, we covered a series of online/offline edge-weighted Steiner tree/forest problems. This lecture extends the discussion to the node-weighted scope. In particular, we will study the nodeweighted Steiner tree/forest problem and introduce an offline O(logn)−approximation polynomial-time algorithm[KR95]. It is well known there is no polynormial-time algorithm that achieves o(...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملSolving Set Covering Problem with Fireworks Explosion
To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection ...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2022
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2022.105763